Optimization of container traffic distribution on the railway network

The paper considers the problem of optimal redistribution transit container flows on railway network. is proposed to be solved as a multi-commodity flow minimum cost using relaxation method. method allows choosing most efficient variant next solution at each iteration step. To search for distribution network, graph theory was used, i.e., network presented multigraph with set vertices and arcs, which costs transporting unit production, maximum values between are given, conditions maintaining restrictions amount along arcs given. It has been established that in order implement task, it necessary take into account movement nodes taking capacity branches junction stations. developed mathematical model traffic you identify areas limited throughput, develop options optimization measures, and, result, achieve an economic effect by reducing containerized cargo.